Image recovery by convex combinations of projections
نویسندگان
چکیده
منابع مشابه
Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
Solving a convex set theoretic image recovery problem amounts to finding a point in the intersection of closed and convex sets in a Hilbert space. The projection onto convex sets (POCS) algorithm, in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several...
متن کاملCombettes : Convex Set Theoretic Image Recovery by Extrapolated Subgradient Projections 3
| Solving a convex set theoretic image recovery problem amounts to nding a point in the intersection of closed and convex sets in a Hilbert space. The POCS algorithm , in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several shortcomings: it converges s...
متن کاملConvex combinations of harmonic shears of slit mappings
In this paper, we study the convex combinations of harmonic mappings obtained by shearing a class of slit conformal mappings. Sufficient conditions for the convex combinations of harmonic mappings of this family to be univalent and convex in the horizontal direction are derived. Several examples of univalent harmonic mappings constructed by using these methods are presented to illustrate...
متن کاملConvex Sets and Convex Combinations
Convexity is one of the most important concepts in a study of analysis. Especially, it has been applied around the optimization problem widely. Our purpose is to define the concept of convexity of a set on Mizar, and to develop the generalities of convex analysis. The construction of this article is as follows: Convexity of the set is defined in the section 1. The section 2 gives the definition...
متن کاملGeneralized convex set theoretic image recovery
In set theoretic image recovery, the constraints which do not yield convex sets in the chosen Hilbert solution space cannot be enforced. In some cases, however , such constraints may yield convex sets in other Hilbert spaces. In this paper we introduce a generalized product space formalism, through which constraints that are convex in diierent Hilbert spaces can be combined. A nonconvex problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1991
ISSN: 0022-247X
DOI: 10.1016/0022-247x(91)90010-w